Asymptotics in the Baum—Katz formula for random fields

In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained.     

Algebraic structure of association schemes of prime order

Finite groups of prime order must be cyclic. It is natural to ask what about association schemes of prime order. In this paper, we will give an answer to this question. An association scheme of prime order is commutative, and its valencies of nontrivial relations and multiplicities of nontrivial irreducible characters are constant. Moreover, if we suppose that the minimal splitting field is an abelian extension of the field of rational numbers, then the character table is the same as that of a Schurian scheme.     

一个新的最优模糊存储模型

提出一个新的具有积压定单的关于模糊订购量的模糊存储模型.在模糊函数原理下,给出了模糊总存储成本.为了寻找最优解,把最优模糊存储模型转化为双目标最优化模型,利用L ingo8.0求解不等式约束问题,我们发现最优解都是确定的实数.此外,当模糊订购量和模糊总需求都是三角形(或权重均为1/2梯形)模糊数时,我们提出模型的最优解与经典的具有积压定单存储模型具有相同的结果.     

单位球上全纯函数空间的系数乘子

本文给出了C^n中超球B上Hardy空间H^p,Bergman空间Lα^p,Bloch空间β，Besov空间Bp及Lipschitz空间Ak^p之间的系数乘子。     

新课标体系下高师本科数学分析教学所面临的问题和所采取的措施

从三个方面讨论了在高中新课标体系下高师本科数学分析教学所面临的问题,并结合作者的实际教学经验给出了一些具有实际操作意义的解决措施和办法.     

Single-period Two-product Inventory Model with Reorder and Substitution

In market, excess demands for many products can be met by reorder even during one period, and retailers usually adopt substitution strategy for more benefit. Under the retailer's substitution strategy and permission of reorder, we develop the profits maximization model for the two-substitutable-product inventory problem with stochastic demands and proportional costs and revenues. We show that the objective function is concave and submodular, and therefore the optimal policy exists. We present the optimal conditions for order quantity and provide some properties of the optimal order quantities. Comparing our model with Netessine and Rudi's, we prove that reorder and adoption of the substitution strategy can raise the general profits and adjust down the general stock level.     

Decision methods for linearly ordered Heyting algebras

The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable; a simple solution is here presented, inspired by related ideas in Gödel-Dummett logic.     

Tiled Orders and Frobenius Rings

Mathematical Notes -     

OnQ-order andR-order of convergence

We give sufficient conditions for a sequence to have theQ-order and/or theR-order of convergence greater than one. If an additional condition is satisfied, then the sequence has an exactQ-order of convergence. We show that our results are sharp and we compare them with older results.This work was supported in part by the National Science Foundation under Grant No. DMS-85-03365. The author wishes to thank J. E. Dennis and R. A. Tapia for helpful comments, and the referee for pointing out a number of typographical and mathematical errors in the original version of this paper.     

基于顺序形态变换的生物芯片图像网格化

生物芯片图像网格化是对由生物芯片扫描得到的荧光成像中的信号(Foreground)和背景(Background)进行划分,以便提取各点的吸光度值、面积和吸光度比等荧光点的数据。网格化的准确与否决定了数据提取的正确性。提出了一种运用顺序形态变换理论实现生物芯片荧光图像网格化的方法,通过对百分位值在0~1之间的顺序形态进行变换,可实现像素灰度的极小值、中间值等多刻度值的灰度取值运算。理论分析表明,该算法能够识别信号与背景的边界,可去除噪声等非边界信息,能判断信号区域,可确定荧光点的边界和范围,可实现荧光点阵图像的网格化。试验结果表明,该算法对不同信噪比的荧光图像来说有很强的适应性,可用于高密度生物芯片图像的处理。